Journal of Beijing University of Posts and Telecommunications

  • EI核心期刊

JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM ›› 2006, Vol. 29 ›› Issue (s2): 96-100.doi: 10.13190/jbupt.2006s2.96.311

• Papers • Previous Articles     Next Articles

Word Sense Disambiguation with Semantic Graph Structure

WANG Jing-hua1, LIU Jian-yi1,2, WANG Cong1   

  1. 1. School of Information Engineering, Beijing University of Posts and Telecommunications, Beijing 100876, China; 2. Graduate School of Chinese Information Processing, Beijing Normal University, Beijing 100875, China)
  • Received:2006-09-12 Revised:1900-01-01 Online:2006-11-30 Published:2006-11-30
  • Contact: WANG Jing-hua

Abstract:

A word sense disambiguation method based on semantic graph structure was presented. In the method, a text is represented as an undirected weighted semantic graph with WordNet, which defines synsets as vertices and relations of vertices as edges, and assigns the weight of edges with the relatedness of connected synsets. Combining with coherence synset and the synset frequency, PageRank* which is a modified PageRank formula for undirected weighted graph, was used to disambiguate the nouns in the text. The experimental result shows that this method is effective and practical.

Key words: word sense disambiguation, semantic graph, WordNet, PageRank

CLC Number: